Search in a Known Pattern
نویسندگان
چکیده
In this paper a market where a buyer (job seeker) is searching in a known order among sellers (e.g. a motorist driving along a road looking for gasoline) is described. Both sellers and buyers are assumed to behave strategically. There are many types of buyers. The sellers know only the distribution of all possible buyers; similarly, buyers have imperfect information about sellers. The analysis is conducted by modeling the market as a game with incomplete information; the equilibrium is characterized. A central feature of the game is that both buyers and sellers rationally update their prior information about each other as the game unfolds sequentially. It is shown that prices need not vary monotonically along the search process.
منابع مشابه
Using Pattern Search Algorithm and Finite Element Method to Detect Rotor Cracks
The vibration pattern of a rotor system reflects the mechanical parameter changes in the system. Hence, the use of vibration monitoring is considered as a possible means of detecting the presence and growth of the cracks. In this paper, a pattern search based method for shaft crack detection is proposed and described which formulates the shaft crack detection as an optimization problem by means...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملA novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملArmentum: a hybrid direct search optimization methodology
Design of experiments (DOE) offers a great deal of benefits to any manufacturing organization, such as characterization of variables and sets the path for the optimization of the levels of these variables (settings) trough the Response surface methodology, leading to process capability improvement, efficiency increase, cost reduction. Unfortunately, the use of these methodologies is very limite...
متن کاملDeveloping Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems
Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...
متن کامل